Uniformly Random Generation of Floorplans

Uniformly-Distributed Random Generation of Join Orders

In this paper we study the space of operator trees that can be used to answer a join query, with the goal of generating elements form this space at random. We solve the problem for queries with acyclic query graphs. We rst count, in O(n 3) time, the exact number of trees that can be used to evaluate a given query on n relations. The intermediate results of the counting procedure then serve to g...

Building uniformly random subtrees

Generating uniformly distributed random networks.

The analysis of real networks taken from the biological, social, and physical sciences often requires a carefully posed statistical null-hypothesis approach. One common method requires comparing real networks to an ensemble of random matrices that satisfy realistic constraints in which each different matrix member is equiprobable. We discuss existing methods for generating uniformly distributed...

Random Perturbations of Non-Uniformly Expanding Maps

Random perturbations of non - uniformly expanding maps ∗

We give both sufficient conditions and necessary conditions for the stochastic stability of non-uniformly expanding maps either with or without critical sets. We also show that the number of probability measures describing the statistical asymptotic behaviour of random orbits is bounded by the number of SRB measures if the noise level is small enough. As an application of these results we prove...